Completion of mathematical systems

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Neuron Mathematical Model Representation of Neural Tensor Network for RDF Knowledge Base Completion

In this paper, a state-of-the-art neuron mathematical model of neural tensor network (NTN) is proposed to RDF knowledge base completion problem. One of the difficulties with the parameter of the network is that representation of its neuron mathematical model is not possible. For this reason, a new representation of this network is suggested that solves this difficulty. In the representation, th...

متن کامل

Mathematical Modeling of the Temperature-Dependent Growth of Living Systems

In this investigation a non-equilibrium thermodynamic model of the temperature dependent biological growth of a living systems has been analyzed. The results are derived on the basis of Gompertzian growth equation. In this model, we have considered the temperature dependent growth rate and development parameter. The non-equilibrium thermodynamic model is also considered for exploring the variat...

متن کامل

neuron mathematical model representation of neural tensor network for rdf knowledge base completion

in this paper, a state-of-the-art neuron mathematical model of neural tensor network (ntn) is proposed to rdf knowledge base completion problem. one of the difficulties with the parameter of the network is that representation of its neuron mathematical model is not possible. for this reason, a new representation of this network is suggested that solves this difficulty. in the representation, th...

متن کامل

Completion of Rewrite Systems with Membership Constraints

We consider a constraint system involving equations and membership constraints. Membership constraints are interpreted as the membership to some recognizable tree languages. The terms may contain a restricted kind of context variables. We give a set of constraint solving rules which is proved to be complete and terminating. This gives a uniication algorithm for an order-sorted logic (without an...

متن کامل

Reduction operators and completion of rewriting systems

Article history: Received 3 June 2016 Accepted 12 February 2017 Available online 23 March 2017

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Pacific Journal of Mathematics

سال: 1962

ISSN: 0030-8730,0030-8730

DOI: 10.2140/pjm.1962.12.589